Symmetry Breaking in the Schr\"odinger Representation for Chern-Simons Theories

This paper discusses the phenomenon of spontaneous symmetry breaking in the Schr\"odinger representation formulation of quantum field theory. The analysis is presented for three-dimensional space-time abelian gauge theories with either Maxwell, Maxwell-Chern-Simons, or pure Chern-Simons terms as the gauge field contribution to the action, each of which leads to a different form of mass generation for the gauge fields.Comment: 16pp, LaTeX , UCONN-94-

Well, to Be Honest, I Wouldnt Start from Here at All

Computational complexity theory and the related area of efficient algorithms have formed significant subfields of Abstract Argumentation going back over 20 years. There have been major contributions and an increased understanding of the computational issues that influence and beset effective implementation of argument methods. My aim, in this article, is to attempt to take stock of the standing of work in complexity theory as it presently is within the field of Computational Argument, as well as offering some personal views on its future direction.</jats:p

Characterizing strongly admissible sets

The concept of strong admissibility plays an important role in dialectical proof procedures for grounded semantics allowing, as it does, concise proofs that an argument belongs to the grounded extension without having necessarily to construct this extension in full. One consequence of this property is that strong admissibility (in contrast to grounded semantics) ceases to be a unique status semantics. In fact it is straightforward to construct examples for which the number of distinct strongly admissible sets is exponential in the number of arguments. We are interested in characterizing properties of collections of strongly admissible sets in the sense that any system describing the strongly admissible sets of an argument framework must satisfy particular criteria. In terms of previous studies, our concern is the signature and with conditions ensuring realizability. The principal result is to demonstrate that a system of sets describes the strongly admissible sets of some framework if and only if that system has the property of being decomposable.</jats:p